Improved approximations for TSP with simple precedence constraints
نویسندگان
چکیده
منابع مشابه
ETH Library Improved Approximations for TSP with Simple Precedence Constraints⋆
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides’ algorithm and Hoogeveen’s algorithm by relating the two underlying problems, i. e., the traveling salesman problem and the problem of finding a minimum-weight Hamiltonian path between two prespecified vertices. We show that the sets of metric ...
متن کاملImproved Approximations for TSP with Simple Precedence Constraints
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides’ algorithm and Hoogeveen’s algorithm by relating the two underlying problems, i. e., the traveling salesman problem and the problem of finding a minimum-weight Hamiltonian path between two prespecified vertices. We show that the sets of metric ...
متن کاملImproved Approximations for Cubic and Cubic Bipartite TSP
We show improved approximation guarantees for the traveling salesman problem on cubic graphs, and cubic bipartite graphs. For cubic bipartite graphs with n nodes, we improve on recent results of Karp and Ravi (2014) by giving a simple “local improvement” algorithm that finds a tour of length at most 5/4n − 2. For 2-connected cubic graphs, we show that the techniques of Mömke and Svensson (2011)...
متن کاملImproved Approximations for Cubic Bipartite and Cubic TSP
We show improved approximation guarantees for the traveling salesman problem on cubic bipartite graphs and cubic graphs. For cubic bipartite graphs with n nodes, we improve on recent results of Karp and Ravi by giving a “local improvement” algorithm that finds a tour of length at most 5/4n − 2. For 2-connected cubic graphs, we show that the techniques of Mömke and Svensson can be combined with ...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2013
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.04.002